Workconserving vs. Non-workconserving Packet Scheduling: an Issue Revisited

نویسنده

  • Erhan Yilmaz
چکیده

Many packet schedulers for QoS networks are equipped with a rate control mechanism. The function of a rate control mechanism (rate controller) is to bu er packets from ows which exceed their negotiated tra c pro le. It has been established that rate controllers lead to reduced bu er requirements at packet switches, and do not increase the worst-case delays in a deterministic service. On the other hand, rate controllers make a scheduler non-workconserving, and, thus, may yield higher average end-to-end delays. In this study, we show that by properly modifying a rate controller, one can design a scheduler which balances bu er requirements against average delays. We present a scheduler, called Earlinessbased Earliest Deadline First (EEDF), which achieves such a balancing using a tunable rate control mechanism. In simulation experiments, we compare EEDF with a rate-controlled EDF scheduler and a workconserving version of EDF.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cell Burst Scheduling for ATM Networking Part I: Theory

Fair queueing is a useful queueing discipline for packet switching systems. It was developed in last decade and was aimed at the general packet switching systems with varying packet length. However, it is not suitable for use in the ATM networking, because the ATM cell length is very small and fixed, and so the scheduling scheme on a per cell basis isn’t practical. Here we introduce the burst a...

متن کامل

Improving Bandwidth Efficiency in a Multi-service Slotted Dual Bus Optical Ring Network

The paper proposes two IP packet aggregation techniques, called DAT (Deterministic Aggregation Technique) and WATT (Workconserving Aggregation Technique with Timer), to adapt IP traffic to a multi-service optical slotted network. To perform aggregation, IP packets belonging to different classes of service (CoS) are polled according to the strict priority (SP) or to an hybrid version of the prob...

متن کامل

Rate-Function Scheduling

Rate-Function Scheduling (RFS) is a new deadline-based packet-scheduling service discipline that supports qualityof service guarantees for applications with real-time communication requirements. RFS is distinguished from other service disciplines in that it achieves all of the following goals: analytically-derived perjormance bounds, perjormance isolation among sessions, jlexible and eficient a...

متن کامل

Delivering QoS Requirements to Traffic with Diverse Delay Tolerances in a TDMA Environment - Networking, IEEE/ACM Transactions on

The focus of this paper is on determining the call admission region and scheduling policies for a time-division multiple-access (wireless) system supporting heterogeneous realtime variable bit rate applications with distinct quality of service (QoS) requirements and traffic characteristics. The QoS is defined in terms of a maximum tolerable packet delay and dropping probability. A packet is dro...

متن کامل

Core-stateless Guaranteed Throughput Networks

Abstract — End-to-end throughput guarantee is an important service semantics that network providers would like to offer to their customers. A network provider can offer such service semantics by deploying a network where each router employs a fair packet scheduling algorithm. Unfortunately, these scheduling algorithms require every router to maintain per-flow state and perform perpacket flow cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999